A remark on multiobjective stochastic optimization via strongly convex functions
نویسنده
چکیده
Many economic and financial applications lead (from the mathematical point of view) to deterministic optimization problems depending on a probability measure. These problems can be static (one stage), dynamic with finite (multistage) or infinite horizon, single objective or multiobjective.We focus on one-stage case in multiobjective setting. Evidently, well known results from the deterministic optimization theory can be employed in the case when the “underlying” probabilitymeasure is completely known. The assumption of a complete knowledge of the probability measure is fulfilled very seldom.Consequently, we havemostly to analyze themathematicalmodels on the data base to obtain a stochastic estimate of the corresponding “theoretical” characteristics. However, the investigation of these estimates has been done mostly in one-objective case. In this paper we focus on the investigation of the relationship between “characteristics” obtained on the base of complete knowledge of the probability measure and estimates obtained on the (above mentioned) data base, mostly in the multiobjective case. Consequently we obtain also the relationship between analysis (based on the data) of the economic process characteristics and “real” economic process. To this end the results of the deterministic multiobjective optimization theory and the results obtained for stochastic one objective problems will be employed.
منابع مشابه
An algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملDuality for multiobjective optimization problems with convex objective functions and D.C. constraints
In this paper we provide a duality theory for multiobjective optimization problems with convex objective functions and finitely many D.C. constraints. In order to do this, we study first the duality for a scalar convex optimization problem with inequality constraints defined by extended real-valued convex functions. For a family of multiobjective problems associated to the initial one we determ...
متن کاملFast Rates for Online Gradient Descent Without Strong Convexity via Hoffman's Bound
Hoffman’s classical result gives a bound on the distance of a point from a convex and compact polytope in terms of the magnitude of violation of the constraints. Recently, several results showed that Hoffman’s bound can be used to derive stronglyconvex-like rates for first-order methods for convex optimization of curved, though not strongly convex, functions, over polyhedral sets. In this work,...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CEJOR
دوره 24 شماره
صفحات -
تاریخ انتشار 2016